Relators and Metric Bisimulations
نویسنده
چکیده
Coalgebras of set functors preserving weak pullbacks are particularly well behaved Invoking a result by Carboni Kelly and Wood we show that this can be explained by the fact that such functors can be uniquely extended to a relator This insight next suggests a de nition of metric bisimulation
منابع مشابه
Preorder Relators and Generalized Topologies
In this paper we investigate generalized topologies generated by a subbase of preorder relators and consider its application in the concept of the complement. We introduce the notion of principal generalized topologies obtained from the new type of open sets and study some of their important properties.
متن کاملSeparating Quasiconvex Subgroups of Right-angled Artin Groups
A graph group, or right-angled Artin group, is a group given by a presentation where the only relators are commutators of the generators. A graph group presentation corresponds in a natural way to a simplicial graph, with each generator corresponding to a vertex, and each commutator relator corresponding to an edge. Suppose that G is a graph group whose corresponding graph is a tree and H is a ...
متن کاملLogical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation
Many behavioural equivalences or preorders for probabilistic processes involve a lifting operation that turns a relation on states into a relation on distributions of states. We show that several existing proposals for lifting relations can be reconciled to be different presentations of essentially the same lifting operation. More interestingly, this lifting operation nicely corresponds to the ...
متن کاملDistribution-Based Bisimulation for Labelled Markov Processes
In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribu...
متن کاملA Calculus for True Concurrency
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 11 شماره
صفحات -
تاریخ انتشار 1998